Extending models of second order predicate logic to models of second order dependent type theoryGEUVERS, H.Lecture notes in computer science. 1997, pp 167-181, issn 0302-9743, isbn 3-540-63172-0Conference Paper

An algorithm to determine, for any prime p, a polynomial-sized horn sentence which expresses the cardinality is not pTULIPANI, S.The Journal of symbolic logic. 1985, Vol 50, Num 4, pp 1062-1064, issn 0022-4812Article

Light linear logicGIRARD, J.-Y.Information and computation (Print). 1998, Vol 143, Num 2, pp 175-204, issn 0890-5401Conference Paper

Une Théorie des Constructions Inductives = A Theory of Inductive ConstructionsWerner, Benjamin; Paulin-Mohring, Christine.1994, 151 p.Thesis

Program-substitution and admissibility of rules in algorithmicBIELA, A.Acta informatica. 1988, Vol 25, Num 4, pp 439-473, issn 0001-5903Article

A simple ordinal recursive normalization of Gödel's TVODA, P. J.Lecture notes in computer science. 1998, pp 491-509, issn 0302-9743, isbn 3-540-64570-5Conference Paper

Logical Foundations of Computer ScienceADIAN, Sergei I.Theoretical computer science. 1999, Vol 224, Num 1-2, issn 0304-3975, 356 p.Conference Proceedings

A note on Kobayashi's and Yonezawa's asynchronous communication model based on linear logicDE GROOTE, P; PERRIER, G.Formal aspects of computing. 1998, Vol 10, Num 2, pp 160-170, issn 0934-5043Article

Stability and paradox in algorithmic logicAITKEN, Wayne; BARRETT, Jeffrey A.Journal of philosophical logic. 2007, Vol 36, Num 1, pp 61-95, issn 0022-3611, 35 p.Article

Hiérarchies de définissabilité logique au second ordre = Hierarchies for second-order logical definabilityDurand, Arnaud; Grandjean, E.1996, 101 p.Thesis

A different approach to deontic logic: deontic logic viewed as a variant of dynamic logicMEYER, J.-J. C.Notre Dame journal of formal logic. 1988, Vol 29, Num 1, pp 109-136, issn 0029-4527Article

The Kolmogorov expression complexity of logicsTYSZKIEWICZ, J.Information and computation (Print). 1997, Vol 135, Num 2, pp 113-135, issn 0890-5401Article

International Conference on Constraints in Computational LogicsJOUANNAUD, Jean-Pierre.Information and computation (Print). 1998, Vol 142, Num 1, issn 0890-5401, 126 p.Conference Proceedings

DEGREE OF RECURSIVE UNSOLVABILITY OF ALGORITHMIC LOGICKRECZMAR A.1972; BULL. ACAD. POLON. SCI., SCI. MATH. ASTR. PHYS.; POLOGNE; DA. 1972; VOL. 20; NO 8; PP. 615-617; ABS. RUSSE; BIBL. 4 REF.Serial Issue

HERBRAND THEOREM IN THE ALGORITHMIC LOGIC. = THEOREME DE HERBRAND DANS LA LOGIQUE ALGORITHMIQUEMIRKOWSKA G.1974; BULL. ACAD. POLON. SCI. SCI. MATH. ASTR. PHYS.; POLOGNE; DA. 1974; VOL. 22; NO 5; PP. 539-543; ABS. RUSSE; BIBL. 4 REF.Article

NOT PROGRAMMABLE FUNCTION DEFINED BY A PROCEDURE.DANKO W.1974; BULL. ACAD. POLON. SCI., SCI. MATH. ASTR. PHYS.; POLOGNE; DA. 1974; VOL. 22; NO 6; PP. 587-594; ABS. RUSSE; BIBL. 3 REF.Article

A SIMPLIFIED FORMALIZATION OF OMEGA ⁺-VALUED ALGORITHMIC LOGIC (A FORMALIZED THEORY OF PROGRAMS).RASIOWA H.1974; BULL. ACAD. POLON. SCI., SCI. MATH. ASTR. PHYS.; POLOGNE; DA. 1974; VOL. 22; NO 6; PP. 595-603; ABS. RUSSE; BIBL. 13 REF.Article

ON THE DECIDABILITY OF PROPOSITIONAL ALGORITHMIC LOGICCHLEBUS BS.1982; Z. MATH. LOGIK GRUNDL. MATH.; ISSN 0044-3050; DDR; DA. 1982; VOL. 28; NO 3; PP. 247-261; BIBL. 8 REF.Article

EXTENDED OMEGA ⁺-VALUED ALGORITHMIC LOGIC. A FORMALIZED THEORY OF PROGRAMS WITH RECURSIVE PROCEDURES.RASIOWA H.1974; BULL. ACAD. POLON. SCI., SCI. MATH. ASTR. PHYS.; POLOGNE; DA. 1974; VOL. 22; NO 6; PP. 605-610; BIBL. 15 REF.Article

THE SET OF ALL TAUTOLOGIES OF THE ZERO-ORDER ALGORITHMIC LOGIC IS DECIDABLEGRABOWSKI M.1972; BULL. ACAD. POLON. SCI., SCI. MATH. ASTR. PHYS.; POLOGNE; DA. 1972; VOL. 20; NO 7; PP. 575-581; ABS. RUSSE; BIBL. 4 REF.Serial Issue

Call-by-value solvabilityPAOLINI, L; RONCHI DELLA ROCCA, S.Informatique théorique et applications (Imprimé). 1999, Vol 33, Num 6, pp 507-534, issn 0988-3754Article

Some notes on the formal definition of streamsMALBASKI, D; IVETIC, D.Yugoslav journal of operations research. 1996, Vol 6, Num 2, pp 277-284, issn 0354-0243Conference Paper

Etude et implémentation d'un système de déduction pour logique algorithmique = Study and implementation of a deduction system for algorithmic logicGARCIA, F.Informatique théorique et applications (Imprimé). 1988, Vol 22, Num 1, pp 57-92, issn 0988-3754Article

Calcul de réécriture : fondements et applications = Rewriting calculus : foundations and applicationsCirstea, Horatiu; Kirchner, Claude.2000, 210 p.Thesis

Modular correctness proofs of behavioural implementationsBIDOIT, M; HENNICKER, R.Acta informatica. 1998, Vol 35, Num 11, pp 951-1005, issn 0001-5903Article